منابع مشابه
Data - parallel polygonization q
Data-parallel algorithms are presented for polygonizing a collection of line segments represented by a data-parallel bucket PMR quadtree, a data-parallel R-tree, and a data-parallel Rþ-tree. Such an operation is useful in a geographic information system (GIS). A sample performance comparison of the three data-parallel structures for this operation is also given. 2003 Published by Elsevier B.V.
متن کاملPolygonization of implicit surfaces
This paper discusses a numerical technique that approximates an implicit surface with a polygonal representation. The implicit function is adaptively sampled as it is surrounded by a spatial partitioning. The partitioning is represented by an octree, which may either converge to the surface or track it. A piecewise polygonal representation is derived from the octree. The technique is insensitiv...
متن کاملPolygonization by the Edge Spinning
This paper presents a new method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles of the resulting polygonal mesh. The main advantages of the triangulation presented are simplicity and the stable features that can be used for next expanding. The implementation is not complicated and only the standard data structures are used. This algorithm is based on ...
متن کاملInteractive Re-Polygonization of Blobby Implicit Curves
An interactive modeling system for implicit curves is presented. Unlike other interactive algorithms, ours displays connected polygonal approximations instead of several unconnected points. We also guarantee that the topology of our polygonal approximation matches the topology of the true curve. The system currently handles only 2-D blobby curves, but will be extended to include general 3-D imp...
متن کاملNear-Optimal Adaptive Polygonization
Consider a triangulation of the xy plane, and a general surface z = f(x; y). The points of the triangle, when lifted to the surface, form a linear spline approximation to the surface. We are interested in the error between the surface and the linear approximant. In fact, we are interested in building triangulations in the plane such that the induced linear approximant is near-optimal with respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Visual Computer
سال: 1999
ISSN: 0178-2789
DOI: 10.1007/s003710050161